Finding a Hamilton cycle fast on average using rotations and extensions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast CUR Approximation of Average Matrix and Extensions

CUR and low-rank approximations are among most fundamental subjects of numerical linear algebra and have applications to a variety of other highly important areas of modern computing as well – they range from machine learning theory and neural networks to data mining and analysis. We first dramatically accelerate computation of such approximations for the average input matrix, then show some na...

متن کامل

Plane rotations and Hamilton-Dirac mechanics

Canonical formalism for SO(2) is developed. This group can be seen as a toy model of the Hamilton-Dirac mechanics with constraints. The Lagrangian and Hamiltonian are explicitly constructed and their physical interpretation are given. The Euler-Lagrange and Hamiltonian canonical equations coincide with the Lie equations. It is shown that the constraints satisfy CCR. Consistency of the constrain...

متن کامل

Finding Hamilton Circuit in a Graph

The purpose of this paper is to develop an algorithm to determine the Hamilton Circuit in a given graph of degree three. This algorithm will find Hamilton Circuit in polynomial steps. We got some properties; these properties are combined to develop the above mentioned algorithm. These principles and their use will be explained by different examples. More or less these principles are simple and ...

متن کامل

On Finding a Cycle Basis with a Shortest Maximal Cycle

The Shortest Maximal Cycle Basis (SMCB) problem is that of finding a cycle basis B of a given graph G such that the length of the longest cycle included in B is the smallest among all bases of G. We show that any cycle basis B’ of G such that the sum of the lengths of the cycles included in B’ is the smallest among all cycle bases of G constitutes a solution to the SMCB problem. Finding a basis...

متن کامل

Ergodicity of Z Extensions of Irrational Rotations

Let T = [0, 1) be the additive group of real numbers modulo 1, α ∈ T be an irrational number and t ∈ T. We consider skew product extensions of irrational rotations by Z 2 determined by T : T × Z 2 → T × Z 2 T (x, s 1 , s 2) = " x + α, s 1 + 2χ [0, 1 2) (x) − 1, s 2 + 2χ [0, 1 2) (x + t) − 1 «. We study ergodic components of such extensions and use the results to display irregularities in the un...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Random Structures & Algorithms

سال: 2020

ISSN: 1042-9832,1098-2418

DOI: 10.1002/rsa.20918